Maratones competidas/Maratón Nacional 2011/workspace/c/c5.cpp

   1 // Equipo Poncho, Carriel y Ruana
   2 using namespace std;
   3 #include <algorithm>
   4 #include <iostream>
   5 #include <iterator>
   6 #include <sstream>
   7 #include <fstream>
   8 #include <cassert>
   9 #include <climits>
  10 #include <cstdlib>
  11 #include <cstring>
  12 #include <string>
  13 #include <cstdio>
  14 #include <vector>
  15 #include <cmath>
  16 #include <queue>
  17 #include <stack>
  18 #include <list>
  19 #include <map>
  20 #include <set>
  21
  22 template <class T> string toStr(const T &x)
  23 { stringstream s; s << x; return s.str(); }
  24 template <class T> int toInt(const T &x)
  25 { stringstream s; s << x; int r; s >> r; return r; }
  26
  27 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  28 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); x != (v).end(); ++x)
  29 #define D(x) cout << #x " = " << (x) << endl;
  30
  31 const double EPS = 1e-9;
  32
  33 int cmp(double x, double y = 0, double tol = EPS) {
  34     return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
  35 }
  36
  37 #define INPUT_FILE "compression"
  38
  39 const int MAXBASES = 105, oo = 1 << 28;
  40 int bases[MAXBASES];
  41
  42 int B, D;
  43 int bit[20]; // bit[i] = index of term i in the document
  44
  45 int dp[MAXBASES][1 << 16];
  46
  47 int docSize;
  48
  49 void binary(int x){
  50     for (int i = 0; i < 16; ++i){
  51         printf("%d", !!(x & (1 << i)));
  52     }
  53 }
  54
  55 void precompute(){
  56 }
  57
  58 void solve(int doc) {
  59
  60     //For(i, 0, B) if (compatible(bases[i])) printf("Base i=%d: %d\n", i, maskOfBase(bases[i]));
  61
  62   //  for (int i = 0; i < 16; ++i) {
  63 //        printf("bit[%d] = %d\n", i, bit[i]);
  64 //    }
  65
  66
  67     for (int mask = 0; mask < (1 << 16); ++mask) {
  68         dp[B][mask] = oo;
  69     }
  70     dp[B][doc] = 0;
  71
  72     for (int b = B - 1; b >= 0; --b) {
  73         for (int mask = 0; mask < (1 << 16); ++mask) {
  74             dp[b][mask] = dp[b+1][mask];
  75             if ((bases[b] | doc) != doc) {
  76                 continue;
  77             }
  78             dp[b][mask] = min(dp[b][mask], dp[b+1][mask | bases[b]] + 1);
  79         }
  80     }
  81
  82     int ans = dp[0][0];
  83     if (ans >= oo) ans = 0;
  84     printf("%d", ans);
  85 }
  86
  87 int main(){
  88     freopen(INPUT_FILE ".in", "r", stdin);
  89     while (cin >> B >> D) {
  90         if (B == 0 and D == 0) break;
  91         for (int i = 0; i < B; ++i) {
  92             bases[i] = 0;
  93
  94             int k; cin >> k;
  95             while (k--) {
  96                 int x; cin >> x; x--;
  97                 bases[i] |= (1 << x);
  98             }
  99             //printf("base[i=%d] = %d\n", i, bases[i]);
 100         }
 101         precompute();
 102         for (int j = 0; j < D; ++j) {
 103             int doc = 0;
 104             cin >> docSize;
 105             int k = docSize;
 106             while (k--) {
 107                 int x; cin >> x; x--;
 108                 doc |= (1 << x);
 109             }
 110             //printf("doc = %d\n", doc);
 111             solve(doc);
 112             if (j + 1 < D) printf(" ");
 113         }
 114         puts("");
 115
 116     }
 117     return 0;
 118
 119 }